Application-Controlled Paging for a Shared Cache
نویسندگان
چکیده
منابع مشابه
Application-Controlled Paging for a Shared Cache
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to information about its own future page requests, and by using that local information along with randomization in the context of a global caching algorithm, we are able to break through the conventional Hk ∼ ln k lower bound o...
متن کاملApplication-Controlled Paging for a Shared Cache (Extended Abstract)
W e consider a cache shared by several concurrently running application processes and propose a provably efficient application-controlled global strategy for the shared cache. Using future information implicitly in the form of good decisions by application processes, we are able to break through the Hk lower bound on competitive ratio proved for classical paging for a k-sized cache in [FKL+91]....
متن کاملBroadcast Disk Paging with a Small Cache
We consider the broadcast disk paging problem when the cache size is 2 and n pages are transmitted. We show an algorithm that is (n 2=(n 2))-competitive and prove that no better competitive ratio is possible.
متن کاملMinimizing Cache Usage in Paging
Traditional paging models seek algorithms that maximize their performance while using the maximum amount of cache resources available. However, in many applications this resource is shared or its usage involves a cost. In this work we introduce the Minimum Cache Usage problem, which is an extension to the classic paging problem that accounts for the efficient use of cache resources by paging al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2000
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539797324278